package DoublePointer;

import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

public class reverseVowels {
    private final static HashSet<Character> vowels = new HashSet<>(
            Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'));

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        reverseVowels reverseVowels = new reverseVowels();
        System.out.println(reverseVowels.reverseVowels(s));
    }

    public String reverseVowels(String s) {
        int length = s.length();
        int l = 0;
        int r = length - 1;
        char[] result = new char[length];
        while (l <= r) {
            if (!vowels.contains(s.charAt(l))) {
                result[l] = s.charAt(l);
                l++;
            } else if (!vowels.contains(s.charAt(r))) {
                result[r] = s.charAt(r);
                r--;
            } else {
                result[l] = s.charAt(r);
                result[r] = s.charAt(l);
                l++;
                r--;
            }
        }
        return new String(result);
    }
}
